Computation on binary tree-networks
نویسندگان
چکیده
منابع مشابه
Graded Computation Tree Logic with Binary Coding
Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the branching-time temporal logic CTL (GCTL), in such a way that they can express statements about a minimal and conservative number of accessible paths. These quantifiers naturally extend to paths the concept of graded world modali...
متن کاملInvariants of Parameterized Binary Tree Networks as Greatest Fixpoints
This paper describes a method to verify safety properties of parameterized binary tree networks of processes. The method is based on the construction of a network invariant, deened as a xpoint. Since least xpoints did not give satisfactory results, backward computation of greatest xpoints is explored, and a technique of computation based on heuristics is proposed. This technique has been implem...
متن کاملPerfect periodic scheduling for binary tree routing in wireless networks
In this paper we tackle the problem of co-ordinating transmission of data across a Wireless Mesh Network. The single task nature of mesh nodes imposes simultaneous activation of adjacent nodes during transmission. This makes the co-ordinated scheduling of local mesh node traffic with forwarded traffic across the access network to the Internet via the Gateway notoriously difficult. Moreover, wit...
متن کاملSupplemental Material of Truncating Wide Networks using Binary Tree Architectures
Proof of Corollary 3.2. The total depth of the given network is LK. Thus, the parameter size is O ( LKD ) . Also, according to Corollary 5 of [6], the maximal number of linear region of functions that can be computed by the given network in an n-dimensional (D > n) input space is lower bounded by O ( (Dn ) n(KL−1)Dn ) , which can be simplified by a looser bound O ( (Dn ) nKL ) and resulting in ...
متن کاملBinary Classification by SVM Based Tree Type Neural Networks
A technique for building a multilayer perceptron classifier network is presented. Initially, a single perceptron tries to correctly classify as many samples as possible. Misclassified samples are taken care of by adding as bias the output of upto two neurons to the parent neuron. The final classification boundary between the two disjoint half spaces at the output of the parent neuron is determi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1986
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90033-8